- nonadjacent
- adj. not adjacent, not near or adjunct

*English contemporary dictionary.
2014.*

### Look at other dictionaries:

**nonadjacent**— [spelling only] … English World dictionary**nonadjacent**— adj.; nonadjacently, adv. * * * … Universalium**nonadjacent**— adjective Not adjacent … Wiktionary**nonadjacent**— non·adjacent … English syllables**nonadjacent**— non ad•ja′cent adj … From formal English to slang**nonadjacent**— adjective not adjacent; not next • Similar to: ↑distant * * * “+ adjective : not adjacent * * * adj.; nonadjacently, adv … Useful english dictionary**Rook's graph**— infobox graph name = Rook s graph image caption = 8x8 Rook s graph vertices = nm edges = nm ( n + m )/2 nm diameter = 2 chromatic number = max( n , m ) chromatic index = girth = 3 (if max( n , m ) ≥ 3) properties = regular, vertex transitive,… … Wikipedia**combinatorics**— /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… … Universalium**Glossary of graph theory**— Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia**Rado graph**— The Rado graph, as numbered by Rado (1964). In the mathematical field of graph theory, the Rado graph, also known as the random graph or the Erdős–Renyi graph, is the unique (up to isomorphism) countable graph R such that for any finite graph G… … Wikipedia